Typed Unification Grammars

A baseline method for compiling typed unification grammars into context free language models

This paper presents a minimal enumerative approach to the problem of compiling typed unification grammars into CFG language models, a prototype implementation and results of experiments in which it was used to compile some non-trivial unification grammars. We argue that enumerative methods are considerably more useful than has been previously believed. Also, the simplicity of enumerative method...

Flexible Structural Analysis of Near-Meet-Semilattices for Typed Unification-Based Grammar Design

We present a new method for directly working with typed unification grammars in which type unification is not well-defined. This is often the case, as large-scale HPSG grammars now usually have type systems for which many pairs do not have least upper bounds. Our method yields a unification algorithm that compiles quickly and yet is nearly as fast during parsing as one that requires least upper...

A Framework for Inductive Learning of Typed-Unification Grammars

LIGHT, the parsing system for typed-unification grammars [3], was recently extended so to allow the automate learning of attribute/feature paths values. Motivated by the logic design of these grammars [2], the learning strategy we adopted is inspired by Inductive Logic Programming [4]; we proceed by searching through hypothesis spaces generated by logic transformations of the input grammar. Two...

Types in Functional Unification Grammars

In this paper, we present several extensions to the FU formalism that address these limitations. These extensions are based on the formal semantics Functional Unification Grammars (FUGs) are presented in (Elhadad, 1990). They have been impopular for natural language applications because the plemented and tested on several applications. formalism uses very few primitives and is uniform and expre...

Learning Attribute Values in Typed-unification Grammars: On Generalised Rule Reduction

Indexing Methods for Efficient Parsing with Typed Feature Structure Grammars

Recent years have witnessed an increase in the use of unification-based grammars, especially of typed feature structure grammars (TFSGs). A major obstacle in developing efficient parsers for unification-based grammars (UBGs) is the slow parsing time caused by the large amount of data and the complex structure used to represent grammatical entities. With the broadening coverage of such grammars,...